On the Pathwidth of Chordal Graphs
نویسنده
چکیده
Gustedt, J., On the pathwidth of chordal graphs, Discrete Applied Mathematics 45 (1993) 233-248. In this paper we first show that the pathwidth problem for chordal graphs is NP-hard. Then we give polynomial algorithms for subclasses. One of those classes are the k-starlike graphs a generalization of split graphs. The other class are the primitive starlike graphs a class of graphs where the intersection behavior of maximal cliques is strongly restricted.
منابع مشابه
Treewidth for Graphs with Small Chordality
A graph G is k-chordal, if it does not contain chordless cycles of length larger than k. The chordality Ic of a graph G is the minimum k for which G is k-chordal. The degeneracy or the width of a graph is the maximum min-degree of any of its subgraphs. Our results are the following: ( 1) The problem of treewidth remains NP-complete when restricted to graphs with small maximum degree. (2) An upp...
متن کاملPathwidth is NP-Hard for Weighted Trees
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for particular subclasses of chordal graphs, and we deduce that the problem remains hard for weighted trees. We also discuss subclasses of chordal graphs for which the problem is polynomial.
متن کاملNecessary edges in k-chordalizations of graphs
In this note, we look at which edges must always be added to a given graph G = (V, E), when we want to make it a chordal graph with maximum clique size at most k by adding edges. lThis problem has a strong relation to the (algorithmic) theory of the treewidth of graphs. If {x, y} is an edge in every chordal supergraph of G with maximum clique size at most k, we call the pair necessary for treew...
متن کاملNecessary Edges in k-Chordalisations of Graphs
In this note, we look at which edges must always be added to a given graph G = (V,E), when we want to make it a chordal graph with maximum clique size at most k by adding edges. lThis problem has a strong relation to the (algorithmic) theory of the treewidth of graphs. If {x, y} is an edge in every chordal supergraph of G with maximum clique size at most k, we call the pair necessary for treewi...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 45 شماره
صفحات -
تاریخ انتشار 1993